Uncertain Programming Model for Chinese Postman Problem with Uncertain Weights
نویسندگان
چکیده
منابع مشابه
Uncertain Programming Model for Solid Transportation Problem
The solid transportation problem is an important extension of the traditional transportation problem. Solid transportation problem with uncertain variables as its parameters is called uncertain solid transportation problem. In this paper, the expected-constrained programming for an uncertain solid transportation problem is given based on uncertainty theory. According to inverse uncertainty dist...
متن کاملA Chance-Constrained Programming Model for Inverse Spanning Tree Problem with Uncertain Edge Weights
The inverse spanning tree problem is to make a given spanning tree be a minimum spanning tree on a connected graph via a minimum perturbation on its edge weights. In this paper, a chance-constrained programming model is proposed to handle the inverse spanning tree problem where the edge weights are assumed to be uncertain variables. It is shown that such an uncertain minimum spanning tree can b...
متن کاملThe Possible Winner Problem with Uncertain Weights
The original possible winner problem is: Given an unweighted election with partial preferences and a distinguished candidate c, can the preferences be extended to total ones such that c wins? We introduce a novel variant of this problem in which not some of the voters’ preferences are uncertain but some of their weights. Not much has been known previously about the weighted possible winner prob...
متن کاملKnapsack Problem with Uncertain Weights and Values
In this paper, the knapsack problem under uncertain environment is investigated, in which the weights and the values are assumed to be uncertain variables. With different criteria, three mathematical models are constructed for the problem, i.e., expected value model, chance-constrained programming model and uncertain measure model. Taking advantage of uncertainty theory, the first two models ca...
متن کاملAn uncertain goal programming model for machine scheduling problem
Machine scheduling is to assign a group of jobs to a set of machines in an efficient strategy, such that some objectives such as minimizing the makespan time are satisfied under some constraints. Considering the human uncertainty in operations, this paper assumes the processing times of the jobs are uncertain variables, and proposes an uncertain goal programming model for the machine scheduling...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Industrial Engineering and Management Systems
سال: 2012
ISSN: 1598-7248
DOI: 10.7232/iems.2012.11.1.018